problem of solvability

См. также в других словарях:

• Solvability — Solv a*bil i*ty, n. [F. solvabilit[ e].] 1. The quality or state of being solvable; as, the solvability of a difficulty; the solvability of a problem. [1913 Webster] 2. The condition of being solvent; ability to pay all just debts; solvency; as,… …   The Collaborative International Dictionary of English

• solvability — noun the property (of a problem or difficulty) that makes it possible to solve • Syn: ↑solubility • Ant: ↑insolubility (for: ↑solubility), ↑unsolvability • Derivationally related forms: ↑ …   Useful english dictionary

• Hilbert's tenth problem — is the tenth on the list of Hilbert s problems of 1900. Its statement is as follows:Given a Diophantine equation with any number of unknown quantities and with rational integral numerical coefficients: To devise a process according to which it… …   Wikipedia

• Word problem for groups — In mathematics, especially in the area of abstract algebra known as combinatorial group theory, the word problem for a recursively presented group G is the algorithmic problem of deciding whether two words represent the same element. Although it… …   Wikipedia

• Undecidable problem — In computability theory and computational complexity theory, an undecidable problem is a decision problem for which it is impossible to construct an algorithm that leads to a yes or no answer the problem is not decidable.A decision problem is any …   Wikipedia

• algebra — /al jeuh breuh/, n. 1. the branch of mathematics that deals with general statements of relations, utilizing letters and other symbols to represent specific sets of numbers, values, vectors, etc., in the description of such relations. 2. any of… …   Universalium

• solvable — solvability, solvableness, n. /sol veuh beuhl/, adj. 1. capable of being solved, as a problem. 2. Math. (of a group) having a normal series of subgroups in which successive quotient groups are Abelian. 3. Archaic. soluble (def. 1). [1640 50;… …   Universalium

• Μ-recursive function — In mathematical logic and computer science, the μ recursive functions are a class of partial functions from natural numbers to natural numbers which are computable in an intuitive sense. In fact, in computability theory it is shown that the μ… …   Wikipedia

• List of important publications in mathematics — One of the oldest surviving fragments of Euclid s Elements, found at Oxyrhynchus and dated to circa AD 100. The diagram accompanies Book II, Proposition 5.[1] This is a list of important publications in mathematics, organized by field. Some… …   Wikipedia

• Elementary algebra — is a fundamental and relatively basic form of algebra taught to students who are presumed to have little or no formal knowledge of mathematics beyond arithmetic. It is typically taught in secondary school under the term algebra. The major… …   Wikipedia

• Group theory — is a mathematical discipline, the part of abstract algebra that studies the algebraic structures known as groups. The development of group theory sprang from three main sources: number theory, theory of algebraic equations, and geometry. The… …   Wikipedia